Flexible Automatic Scheduling For Autonomous Telescopes: The MAJORDOME
نویسندگان
چکیده
Abstract. We have developped a new method for the scheduling of astronomical automatic telescopes, in the framework of the autonomous TAROT instrument. The MAJORDOME software can handle a variety of observations, constrained, periodic, etc., and produces a timeline for the night, which may be modified at any time to take into account the specific conditions of the night. The MAJORDOME can also handle target of opportunity observations without delay.
منابع مشابه
Flexible Scheduling of Automatic
This paper outlines a new telescope operations paradigm that is intended to achieve low operating costs with high operating ef-ciency and high scientiic productivity. The paradigm is based on the existing Principal Astronomer approach used in conjunction with atis, a language for commanding remotely located automatic telescopes. This paper describes a telescope management system called the Asso...
متن کاملScheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملAutomated Management and Scheduling of Remote Automatic Telescopes
This paper describes our project on advanced planning and scheduling for remote, fully automatic telescopes. In addition to a more advanced automatic scheduler for nightly observations, our project is also building automated tools to address the entire life-cycle of an observation request, from original receipt to the return of raw data and preliminary data reduction. Our focus is on providing ...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کامل